Exponential Lower Bounds for AC 0 -Frege Imply Superpolynomial Frege Lower Bounds
نویسندگان
چکیده
منابع مشابه
Exponential Lower Bounds for AC-Frege Imply Superpolynomial Frege Lower Bounds
We give a general transformation which turns polynomialsize Frege proofs to subexponential-size AC-Frege proofs. This indicates that proving exponential lower bounds for AC-Frege is hard, since it is a longstanding open problem to prove super-polynomial lower bounds for Frege. Our construction is optimal for tree-like proofs. As a consequence of our main result, we are able to shed some light o...
متن کاملA Exponential Lower Bounds for AC-Frege Imply Superpolynomial Frege Lower Bounds
We give a general transformation which turns polynomial-size Frege proofs to subexponential-size AC0Frege proofs. This indicates that proving truly exponential lower bounds for AC0-Frege is hard, since it is a longstanding open problem to prove super-polynomial lower bounds for Frege. Our construction is optimal for proofs of formulas of unbounded depth. As a consequence of our main result, we ...
متن کاملBounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m 1 1 polylog n n. This lower bound qualitatively matches the known quasi-polynomial-size bounded-depth Frege proofs for these principles. Our technique, which uses a switching lemma argument like other lower bounds for boundeddepth Frege proofs, is novel in that the tautol...
متن کاملLinear Lower Bounds and Simulations in Frege Systems with Substitutions
We investigate the complexity of proofs in Frege (F), Substitution Frege (sF) and Renaming Frege (rF) systems. Starting from a recent work of Urquhart and using Kolmogorov Complexity we give a more general framework to obtain superlogarithmic lower bounds for the number of lines in both tree-like and dag-like sF. We show the previous known lower bound, extend it to the tree-like case and, for a...
متن کاملSome Lower Bounds in Parameterized AC^0
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical AC0. Among others, we derive such a lower bound for all fptapproximations of the parameterized clique problem and for a parameterized halting problem, which recently turned out to link problems of computational complexity, descriptive complexity, and proof theory. To show the fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2015
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2656209